A Novel TDOA-Based Localization Algorithm Using Sequential Quadratic Programming
نویسندگان
چکیده
منابع مشابه
TDoA based UAV Localization using Dual-EKF Algorithm
Most UAV(unmaned aerial vehicle) systems use GPS signals only to locate the emitter’s position. However GPS signals contain unwanted information contaminated by environmental components and many interference signals. In this paper, to obtain TDoA signal, we use two UAVs which are equipped with embedded wireless sensors. Under the real geolocation circumstance, it is very difficult to estimate t...
متن کاملTDoA-based Localization Using Enhanced Multilateration
For the IPSN 2016 Microsoft indoor localization competition, we propose a system based on uplink TDoA using commerically available hardware from Nanotron and a proprietary multilateration algorithm.
متن کاملA Computationally Efficient Feasible Sequential Quadratic Programming Algorithm
A sequential quadratic programming (SQP) algorithm generating feasible iterates is described and analyzed. What distinguishes this algorithm from previous feasible SQP algorithms proposed by various authors is a reduction in the amount of computation required to generate a new iterate while the proposed scheme still enjoys the same global and fast local convergence properties. A preliminary imp...
متن کاملA Sequential Quadratic Programming Algorithm for Nonconvex, Nonsmooth Constrained Optimization
We consider optimization problems with objective and constraint functions that may be nonconvex and nonsmooth. Problems of this type arise in important applications, many having solutions at points of nondifferentiability of the problem functions. We present a line search algorithm for situations when the objective and constraint functions are locally Lipschitz and continuously differentiable o...
متن کاملA Feasible Trust-Region Sequential Quadratic Programming Algorithm
An algorithm for smooth nonlinear constrained optimization problems is described, in which a sequence of feasible iterates is generated by solving a trust-region sequential quadratic programming (SQP) subproblem at each iteration, and perturbing the resulting step to retain feasibility of each iterate. By retaining feasibility, the algorithm avoids several complications of other trust-region SQ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Hybrid Information Technology
سال: 2016
ISSN: 1738-9968,1738-9968
DOI: 10.14257/ijhit.2016.9.11.09